Channel Upgradation for Non-Binary Input Alphabets and MACs
نویسندگان
چکیده
منابع مشابه
Asymptotic Fingerprinting Capacity for Non-binary Alphabets
We compute the channel capacity of non-binary fingerprinting under the Marking Assumption, in the limit of large coalition size c. The solution for the binary case was found by Huang and Moulin. They showed that asymptotically, the capacity is 1/(c2 ln 2), the interleaving attack is optimal and the arcsine distribution is the optimal bias distribution. In this paper we prove that the asymptotic...
متن کاملUpgraded Approximation of Non-Binary Alphabets for Polar Code Construction
An algorithm is presented for approximating a single-user channel with a prime input alphabet size. The result is an upgraded version of the channel with a reduced output alphabet size. It is shown that this algorithm can be used to reduce the output alphabet size to the input alphabet size in most cases.
متن کاملLinear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets
Goldreich suggested candidates of one-way functions and pseudorandom generators included in NC. It is known that randomly generated Goldreich’s generator using (r−1)-wise independent predicates with n input variables and m = Cn output variables is not pseudorandom generator with high probability for sufficiently large constant C. Most of the previous works assume that the alphabet is binary and...
متن کاملSome Results on Reversible Gate Classes Over Non-Binary Alphabets
We present a collection of results concerning the structure of reversible gate classes over non-binary alphabets, including (1) a reversible gate class over non-binary alphabets that is not finitely generated (2) an explicit set of generators for the class of all gates, the class of all conservative gates, and a class of generalizations of the two (3) an embedding of the poset of reversible gat...
متن کاملFaster Binary-Field Multiplication and Faster Binary-Field MACs
This paper shows how to securely authenticate messages using just 29 bit operations per authenticated bit, plus a constant overhead per message. The authenticator is a standard type of “universal” hash function providing information-theoretic security; what is new is computing this type of hash function at very high speed. At a lower level, this paper shows how to multiply two elements of a fie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2652483